Source Level Static Branch Prediction
نویسندگان
چکیده
منابع مشابه
Source Level Static Branch Prediction
The ability to predict the directions of branches, especially conditional branches, is an important problem in modern computer architecture and advanced compilers. Many static and dynamic techniques have been proposed. Today, all state-of-the-art microprocessors have some form of hardware support for dynamic branch prediction. Static techniques, on the other hand, have not been widely studied b...
متن کاملStatic Branch Prediction Using High-Level Language Control Structure
The ability to correctly predict conditional branch behavior at compilation time enables compilers to protably apply code optimizations as well as to improve code layout and achieve a better schedule by increasing instruction level parallelism. Prole-based static prediction produces accurate predictions but requires programmer intervention. Analternativeis to applystatic(i.e., heuristic-based)b...
متن کاملTwo-level branch prediction using neural networks
Dynamic branch prediction in high-performance processors is a specific instance of a general time series prediction problem that occurs in many areas of science. Most branch prediction research focuses on two-level adaptive branch prediction techniques, a very specific solution to the branch prediction problem. An alternative approach is to look to other application areas and fields for novel s...
متن کاملA Decoupled Fetch-Execute Engine with Static Branch Prediction Support
We describe a method for supporting static branch prediction on a decoupled fetch-execute pipeline. Using instruction buffers to decouple instruction fetch from the execute pipeline is an effective way to minimize instruction cache penalties by allowing instruction fetch and stall miss handling to proceed independent of the execution pipeline. Dynamic branch prediction is typically used with su...
متن کاملStatic and Dynamic Branch Prediction Using Neural Networks
In this short paper we investigated a new static branch prediction technique. The main idea of this technique is to use a large body of different programs (benchmarks) to identify and infer common C program behaviour. Then, this knowledge is used to predict new “unseen” branches belonging to new programs. The common behaviour is represented as a set of static features of branches that are mappe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1999
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/42.2.142